Constraints are the solution, not the problem
نویسندگان
چکیده
Reichle and Reingold (2013) presented the hypothesis that parafoveal preview is a requirement for the average fixation during reading in order for lexical processing to control eye movements. Taking 240 ms as the customary fixation duration in reading a single word, they arrive at their conclusion by decomposing these 240 ms into stages of a strictly serial-processing model. This subtractive accounting finds the visual system coming up short so long as lexical processing is strictly foveal, that is, so long as lexical processing addresses only the word directly in front of the fovea during a fixation. Neurophysiological estimates of latencies in retinal transmission to the brain and in visual encoding leave little more than 60 ms for lexical processing and 90 ms for programming the next saccade. Reichle and Reingold’s solution to this processing bottleneck is to propose that lexical processing of the next word usually begins parafoveally, that is, during the fixation of the current word. We question the generality of the solution that Reichle and Reingold (2013) offer. Rather the observation of comparatively short fixation durations may tie in with a wider range of findings on remarkably fast response times in which cognitive, neural, and physiological events unfolding at various time scales conspire to poise the human organism for a variety of stimuli and dramatically reduce the time needed to arrive at sensible response from stimulus onset (Wallot and Van Orden, 2012). We argue that the solution to the problem can be found by investigating the contextual constraints organizing cognitive activity.
منابع مشابه
Linear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملیک الگوریتم کارا برای زیر مسالهی ناحیه اطمینان توسیع یافته با دو قید خطی
Trust region subproblem (TRS), which is the problem of minimizing a quadratic function over a ball, plays a key role in solving unconstrained nonlinear optimization problems. Though TRS is not necessarily convex, there are efficient algorithms to solve it, particularly in large scale. Recently, extensions of TRS with extra linear constraints have received attention of several researchers. It ha...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملSum-Rate Maximization Based on Power Constraints for Cooperative AF Relay Networks
In this paper, our objective is maximizing total sum-rate subject to power constraints on total relay transmit power or individual relay powers, for amplify-and-forward single-antenna relay-based wireless communication networks. We derive a closed-form solution for the total power constraint optimization problem and show that the individual relay power constraints optimization problem is a quad...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 8 شماره
صفحات -
تاریخ انتشار 2014